Generalization of space-filling bearings to arbitrary loop size
نویسندگان
چکیده
منابع مشابه
Generalization of space-filling bearings to arbitrary loop size
A model for space-filling packing of discs rolling sliplessly on each other is presented. This model is an extension of the model presented by Herrmann et al to a basic loop size of an arbitrary even number of discs. This model might have application in geophysics, dense granular flows and turbulence. We show the existence and uniqueness of such constructions, analytically, for loop size up to ...
متن کاملComplex networks from space-filling bearings.
Two-dimensional space-filling bearings are dense packings of disks that can rotate without slip. We consider the entire first family of bearings for loops of four disks and propose a hierarchical construction of their contact network. We provide analytic expressions for the clustering coefficient and degree distribution, revealing bipartite scale-free behavior with a tunable degree exponent dep...
متن کاملSpace-filling bearings in three dimensions.
We present the first space-filling bearing in three dimensions. It is shown that a packing which contains only loops of an even number of spheres can be constructed in a self-similar way and that it can act as a three-dimensional bearing in which spheres can rotate without slip and with negligible torsion friction.
متن کاملAnalytic Solution of Thermal Spreading Resistance: Generalization to Arbitrary-shape Heat Sources on a Half-space
Thermal spreading resistance is an important phenomenon in contacting bodies and local heating e.g. laser heating. In contacting bodies, the real area of contact is typically less than 2% of the nominal contact area. In practice, due to random nature of contacting surfaces, the actual shape of microcontacts is unknown; therefore, it is advantageous to have a model applicable to any arbitrary-sh...
متن کاملFolding Arbitrary 3D Shapes with Space Filling Chain Robots: Reverse Explosion Approach to Folding Sequence Design
We propose a method for arbitrary 3D shape formation by folding chains of hinged polyhedra. This paper presents an algorithm that finds a folding trajectory from an unfolded chain to a target folded chain in a Hamiltonian path configuration. The algorithm is based on the observation that unfolding is generally easier than folding. We can find an unfolding trajectory by applying a radial force t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2000
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/33/7/310